The "consumption first and replenishment afterward" operation model of the power supply companies may cause the risk of arrears due to poor credit of some power consumers. Therefore, it is necessary to analyze of the tremendous user data in real-time and quickly before the arrears' happening and provide a list of the potential customers in arrear. In order to solve the problem, a method for arrears alert of power consumers based on the parallel classification algorithm was proposed. Firstly, the arrear behaviors were modeled by the parallel Random Forest (RF) classification algorithm based on the Spark framework. Secondly, based on previous consumption behaviors and payment records, the future characteristics of consumption and payment behavior were predicted by time series. Finally, the list of the potential hig-risk customers in arrear was obtained by using the obtained model for classifying users. The proposed algorithm was compared with the parallel Support Vector Machine (SVM) algorithm and Online Sequential Extreme Learning Machine (OSELM) algorithm. The experimental results demonstrate that, the prediction accuracy of the proposed algorithm performs better than the other algorithms in comparison. Therefore, the proposed method is a convenient way for electricity recycling management to remind the customers of paying the electricity bills ahead of time, which can ensure timeliness electricity recovery. Moreover, the proposed method is also beneficial for consumer arrear risk management of the power supply companies.

A multi-objective particle swarm optimization with decomposition for network community discovery was proposed and the multi-objective optimization model of community discovery was constructed through comparing the optimization objectives of different community discovery algorithms in social network. The proposed algorithm adopted the Chebyshev method to decompose the multi-objective optimization problem into a number of single-objective optimization sub-problems and used Particle Swarm Optimization (PSO) to discover the community structure. Moreover, a new local search based mutation strategy was put forward to improve the search efficiency and speed up convergence. The proposed algorithm overcame the defects of single objective optimization methods. The experimental results on synthetic networks and real-world networks show that the proposed algorithm can discover the community structure rapidly and accurately and reveal the hierarchical community structure.